Switched PIOA: Parallel composition via distributed scheduling
نویسندگان
چکیده
منابع مشابه
Switched PIOA: Parallel composition via distributed scheduling
This paper presents the framework of switched probabilistic input/output automata (or switched PIOA), augmenting the original PIOA framework with an explicit control exchange mechanism. Using this mechanism, we model a network of processes passing a single token among them, so that the location of this token determines which process is scheduled to make the next move. This token structure there...
متن کاملParallel Job Scheduling in Homogeneous Distributed Systems
The performance of parallel programs such as those involving fork-join instructions is significantly affected by the method used to schedule program tasks. This paper studies parallel job scheduling in homogeneous distributed systems. A simulation model is used to address performance issues associated with scheduling. Various policies are employed to schedule parallel jobs over a variety of wor...
متن کاملRuntime Incremental Parallel Scheduling ( RIPS ) on Distributed
| Runtime Incremental Parallel Scheduling (RIPS) is an alternative strategy to the commonly used dynamic scheduling. In this scheduling strategy, the system scheduling activity alternates with the underlying computation work. RIPS utilizes the advanced parallel scheduling technique to produce a low-overhead, high-quality load balancing, as well as adapting to irregular applications. This paper ...
متن کاملTask scheduling in parallel and distributed systems
It sounds good when knowing the task scheduling in parallel and distributed systems in this website. This is one of the books that many people looking for. In the past, many people ask about this book as their favourite book to read and collect. And now, we present hat you need quickly. It seems to be so happy to offer you this famous book. It will not become a unity of the way for you to get a...
متن کاملRobust distributed scheduling via time-period aggregation
In this paper, we evaluate whether the robustness of a market mechanism that allocates complementary resources could be improved through the aggregation of time periods in which resources are consumed. In particular, we study a multi-round combinatorial auction that is built on a general equilibrium framework. We adopt the general equilibrium framework and the particular combinatorial auction d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2006
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2006.07.033